Asymptotic Approximation of Convex Curves
نویسنده
چکیده
L. Fejes Tóth gave asymptotic formulae as n → ∞ for the distance between a smooth convex disc and its best approximating inscribed or circumscribed polygons with at most n vertices, where the distance is in the sense of the symmetric difference metric. In this paper these formulae are extended by specifying the second terms of the asymptotic expansions. Tools are from affine differential geometry.
منابع مشابه
Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملAsymptotic Approximation of Convex Curves; the Hausdorff Metric Case
where κ(t) is the curvature of C given as a function of the arclength t and l the length of C. See also McClure and Vitale [7] and for asymptotic formulae for approximation with respect to the Hausdorff metric in higher dimensions R. Schneider [8],[9] and P.M. Gruber [5]. In this article we extend the asymptotic formulae (1) by deriving the second terms in the asymptotic expansions of δ(C,P i n...
متن کاملBest proximity point theorems in Hadamard spaces using relatively asymptotic center
In this article we survey the existence of best proximity points for a class of non-self mappings which satisfy a particular nonexpansiveness condition. In this way, we improve and extend a main result of Abkar and Gabeleh [A. Abkar, M. Gabeleh, Best proximity points of non-self mappings, Top, 21, (2013), 287-295] which guarantees the existence of best proximity points for nonex...
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994